Storage capacity usage management

ABSTRACT

This disclosure provides a method, a computing system and a computer program product for managing storage capacity usage in a storage system. For each of a plurality of logical storage arrays in the storage system, a Remaining Time Buffer (RTB) measure indicating time to use up respective free space currently available to the logical storage array is calculated. Respective free space currently available to each of one or more of the plurality of logical storage arrays is adjusted, so that the RTB measures of the one or more logical storage arrays satisfy a threshold.

BACKGROUND

The present disclosure relates to storage management, and morespecifically, to storage capacity usage management method and system fora storage system of a plurality of logical storage arrays with a sharedstorage controller.

Generally, a storage system may comprise a plurality of logical storagearrays arranged in the same pool or across different pools and backed byarrays of physical or tangible storage devices. A storage controllerbridges the logical storage arrays with the physical storage devices byperforming address transformation and capacity management. Serverapplications write/read data to/from the logical storage arrays. In theunderlying layer, the write/read operations are re-directed to specificaddresses in the tangible storage devices by the storage controller.

A storage controller may be shared by two or more logical storage arraysby providing a shared physical capacity in the backend storage devicesto the two or more logical storage arrays. In some cases, logicalstorage arrays may have large logical capacities claimed from thestorage controller, but the storage controller actually reserves orallocates small physical capacities on the physical storage devices forthe logical arrays to improve storage capacity utilization efficiency.Thin provisioning (TP) is one of such storage mechanisms. Thinprovisioning, also referred to as over-allocation or over-subscription,is a virtualized storage mechanism for automatically optimizing storagecapacity utilization efficiency. Thin provisioning allows flexible,dynamic and sequential allocation of storage space to serverapplications on a just-enough, just-in-time and on-demand basis.

SUMMARY

Disclosed herein are embodiments of a method, computing system andcomputer program product for managing storage capacity usage in astorage system.

According to one embodiment of the present disclosure, there is provideda method for managing storage capacity usage in a storage system. Foreach of a plurality of logical storage arrays in the storage system, aRemaining Time Buffer (RTB) measure indicating time to use up respectivefree space currently available to the logical storage array iscalculated. Respective free space currently available to each of one ormore of the plurality of logical storage arrays is adjusted, so that theRTB measures of the one or more logical storage arrays satisfy athreshold.

According to another embodiment of the present disclosure, there isprovided a computing system. The computing system comprises a processorand a computer-readable memory unit coupled to the processor, the memoryunit comprising instructions, when executed by the processor, forimplementing the method as provided according to embodiments of thepresent disclosure.

According to another embodiment of the present disclosure, there isprovided a computer program product. The computer program productcomprises a computer readable storage medium having program instructionsembodied therewith, the program instructions executable by a processorto cause the processor to implement the method as provided according toembodiments of the present disclosure.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Through the more detailed description of some embodiments of the presentdisclosure in the accompanying drawings, the above and other objects,features and advantages of the present disclosure will become moreapparent, wherein the same reference generally refers to the samecomponents in the embodiments of the present disclosure.

FIG. 1 shows an exemplary computer system which is applicable toimplement the embodiments of the present disclosure;

FIG. 2 is a schematic diagram illustrating a storage system 200according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram illustrating the capacity usage status ofmapped arrays and physical extents for LSAs of FIG. 2;

FIG. 4 is a schematic diagram illustrating the space usage versus spaceconsuming speed for each entity in the storage system as shown in FIG.2;

FIG. 5 illustrates a flow chart of a method for managing storagecapacity usage in a storage system according to an embodiment of thedisclosure;

FIG. 6 illustrates an exemplary process for managing storage capacityusage for a storage system to achieve balanced free space among all theentities involved in accordance with an embodiment of the presentdisclosure;

FIG. 7 illustrates an exemplary process for managing storage capacityusage for a storage system to detect and avoid out-of-space emergency inaccordance with an embodiment of the present disclosure.

DETAILED DESCRIPTION

Some embodiments will be described in more detail with reference to theaccompanying drawings, in which the embodiments of the presentdisclosure have been illustrated. However, the present disclosure can beimplemented in various manners, and thus should not be construed to belimited to the embodiments disclosed herein.

Referring now to FIG. 1, in which an exemplary computer system/server 12which is applicable to implement the embodiments of the presentinvention is shown. FIG. 1 is also adapted to depict an illustrativeexample of a portable electronic device such as a communication devicewhich is applicable to implement the embodiments of the presentinvention. Computer system/server 12 is only illustrative and is notintended to suggest any limitation as to the scope of use orfunctionality of embodiments of the invention described herein.

As shown in FIG. 1, computer system/server 12 is shown in the form of ageneral-purpose computing device. The components of computersystem/server 12 may include, but are not limited to, one or moreprocessors or processing units 16, a system memory 28, and a bus 18 thatcouples various system components including system memory 28 toprocessor 16.

Bus 18 represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include Industry Standard Architecture (ISA) bus,Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, VideoElectronics Standards Association (VESA) local bus, and PeripheralComponent Interconnect (PCI) bus.

Computer system/server 12 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 12, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 28 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 30 and/or cachememory 32. Computer system/server 12 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 34 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 18 by one or more datamedia interfaces. As will be further depicted and described below,memory 28 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 40, having a set (at least one) of program modules 42,may be stored in memory 28 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 42 generally carry out the functions and/ormethodologies of embodiments of the invention as described herein.

Computer system/server 12 may also communicate with one or more externaldevices 14 such as a keyboard, a pointing device, a display 24, etc.;one or more devices that enable a user to interact with computersystem/server 12; and/or any devices (e.g., network card, modem, etc.)that enable computer system/server 12 to communicate with one or moreother computing devices. Such communication can occur via Input/Output(I/O) interfaces 22. Still yet, computer system/server 12 cancommunicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 20. As depicted, network adapter 20communicates with the other components of computer system/server 12 viabus 18. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 12. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, external disk drive arrays,RAID systems, tape drives, and data archival storage systems, etc.

As mentioned above, mechanisms such as thin provisioning (TP) that allowclaimed logical capacity larger than physical capacity have advantages.Specifically, a server application can claim larger storage capacityfrom a thin provisioning storage device than that has been physicallyreserved or allocated on the storage device itself for the serverapplication. Physical storage capacity on the storage device is onlydedicated when data is actually written by the application (physicalstorage capacity is actually used), not when the storage capacity isinitially claimed. When the application has used up a proportion of itsclaimed capacity, the storage system automatically enlarges the physicalcapacity for the application. In contrast to traditional allocationmethods called “fat” or “thick” provisioning, where large storagecapacity is physically allocated and dedicated to an application upfront but remains unused, resulting in poor utilization rates, thinprovisioning provides extremely high utilization efficiency bypreventing allocation of storage capacity to unwritten data area.

However, issues such as out-of-space situation or unbalanced space usageeasily arise with a storage system comprising a plurality of logicalstorage arrays with one or more shared storage controllers, especiallywhen the logical storage arrays adopt the thin provisioning mechanism. Ashared storage controller can offer different parts of its wholecapacity to different TP logical storage arrays, so that each of the TPlogical storage arrays can make use of the storage controller. The TPlogical storage arrays can be in a competitive relationship with eachother in obtaining more free space from the storage controller. As thelogical storage arrays are unaware of their physical capacityconsumption, they may easily run out of the physical space provided bythe storage controller. Moreover, there may be unbalanced space usageamong the logical storage arrays sharing the same controller when onelogical storage array is allocated with small physical capacity but hasintensive read/write operations (i.e., heavy workload) thereto whileanother logical storage array with infrequent read/write operations(i.e., light workload) has large physical space reserved by thecontroller.

The situation gets worse when TP logical storage arrays that share thesame storage controller are distributed across different storage poolsadopting data reduction (DR) technology. For a virtualized storagesystem, storage pool is used as the basic concept for a set ofvirtualized volumes backed up by a plurality of physical storagedevices. To provide higher utilization of physical resource of thestorage devices, data reduction technology is introduced. Datacompression, data deduplication and thin provisioning are someimplementing methods of data reduction techniques. Data reduction useslog structured file (LSF) system as the basis technology to improvewrite performance and thereby the overall I/O performance, as readoperations can be almost always satisfied from increasing size of memorycache and the I/O operations are becoming write-heavy. A log structuredfile system treats its storage as a circular log and always writeschanges of data sequentially to the head of the log versus conventionalfile system where changes of data are written in-place. To avoid thestorage from being full, the log structured file system utilizes garbagecollector to reclaim the old overwritten data blocks. However, garbagecollector may not operate quickly enough. As write operations fromdifferent pools keep consuming free space of the shared controller, thephysical space of that controller would be consumed up eventually,without informing the pools. In such a case, when a TP logical storagearray in any pool needs to increase its physical space, the attempt onthe shared controller shall fail and the pool would be down since it isunable to conduct any write operation to that controller due to nophysical space. In fact, all other pools sharing the same controllerwould also go down for the same reason.

Currently, there are systems allowing user to enable array-side thinprovisioning. But the systems need the users to manually monitor andmanage the physical capacity. Automatic mechanism to prevent thephysical space of controllers that are shared by multiple logicalstorage arrays from being consumed unbalanced or to protect thecontroller from an out-of-space situation is still needed.

With reference now to FIG. 2, FIG. 2 is a schematic diagram illustratinga storage system 200 according to an embodiment of the presentdisclosure. The storage system 200 comprises a plurality of logicalstorage arrays (LSAs). At least two LSAs may share a same storagecontroller. As a non-limiting example, FIG. 2 shows four LSAs with LSA 2and LSA 3 sharing the same controller 220. LSAs may be any logicalstorage arrays that have claimed capacities larger than or equal totheir physical capacities. In the example as shown in FIG. 2, LSA 2 andLSA 3 are TP LSAs that have claimed capacities larger than theirphysical capacities available from the controller 220; while LSA 1 andLSA 4 are internal LSAs whose claimed capacities are equal to theirphysical capacities. In other embodiments, the plurality of LSAs mayhave other configurations. LSAs are distributed in a same storage poolor across different storage pools. In the example as shown in FIG. 2,LSA 1 and LSA 2 belong to Pool 0 and LSA 3 and LSA 4 belong to Pool 1.Accordingly, the controller 220 is shared across different pools (Pool 0and Pool 1 are collectively referred to as pool(s) or storage pool(s)210). Storage pools 210 provide virtual storage space for respectiveserver applications 232 on a server 230 and function as an interfacebetween the server 230 and the controller 220. One or more storage pools210 may adopt data reduction (DR) mechanism by using a log structuredfile system.

The storage system 200 further comprises storage controller 220. Thestorage controller 220 includes a processing unit 222 in communicationwith memory 224 and is embodied with a storage medium 226. Theprocessing unit 222 may be configured to execute instructions stored onthe memory 224 to perform various kinds of management functionalities onstorage space of the storage medium 226. In one embodiment, the storagemedium 226 includes multiple arrays of storage devices such as variousforms of Redundant Array of Independent Disks (RAID) formed from anykind of non-volatile storage devices, comprising but not limited to harddrive disk (HDD), solid state disk (SSD) or a flash memory. The storagecontroller 220 may be in local or remote communication with one or moreservers 230. As a non-limiting example, a server 230 with twoapplications (APP 0 and APP 1) running is illustrated. Applications 232,also referred to as user or client applications, read or write data fromor to storage pools 210 (e.g. Pool 0 for APP 0 and Pool 1 for APP 1).The read or write operations to LSA 2 and 3 are re-directed to physicalspace provided by the storage medium 226 by the controller 220.

Block 240 shows virtual volumes 242 and 243 of the controller 220 whichare respectively corresponding to LSA 2 and LSA 3. Block 250 shows thespace usage status of the backend storage medium of the controller.Physical space provided by the storage medium 226 is divided into a setof extents 252. An extent, as a unit for space allocation, is a stringof sequential physical addresses. In the example of FIG. 2, the backendof controller contains 6 extents of which two have been allocated to LSA2, two have been allocated to LAS 3 and the remaining two are free. Withthin provisioning configuration, the two free extents may be allocatedto any of LSA 2 and LSA 3 on demand

FIG. 3 is a schematic diagram illustrating the capacity usage status ofmapped arrays and physical extents for LSAs of FIG. 2. Blocks 310 and312 shows the usage status of mapped arrays for LSA 2 and LSA 3. As anexample, LSA 2 and LSA 3 may respectively claim a virtual capacity offour and six extents from the shared controller. LSA 2 has written datato two of the six extents, leaving two free extents, while LSA 3 haswritten data to four of the six extents, leaving two free extents. Forthose extents have been written, there are three different data writtenstatus: (1) ‘invalid’ represents an old extent in which all data getsoverwritten; (2) ‘used’ represents an extent that has been fully writtenwith data; and (3) ‘using’ represents an extent that has been partiallywritten with data. Regardless of the data written status of the extents,the backend of controller only cares about whether a specific extent hasbeen allocated or is free. As shown in block 314, the backend of thecontroller has a total physical size of six extents, of which two havebeen allocated to LSA 2 (shown in block 316, corresponding to the twoextents that have been written in block 310) and four have beenallocated to LSA 3 (shown in block 318, corresponding to the fourextents that have been written in block 312). In such a case, Pool 0 andPool 1 have consumed up all the physical capacity of the controller butare unaware of this. When any of the pools attempts to write more datato LSA 2 or LSA 3, and if the garbage collection cannot recycle theinvalid extents quickly, it will go down for an out-of-space condition.

Another issue shown in FIG. 3 with the storage system is unbalancedspace usage. When creating the mapped array 3, Pool 1 claimed much morespace than Pool 0 for the mapped array 2, expecting there would be moredata to keep. In this case, the controller would provide plenty ofphysical space for Pool 1. However, Pool 0 may be in heavy writeworkload, and Pool 1 may be on the contrary. For example, the controllerwould be continually increasing the array size for Pool 0 which is a DRpool, due to its fast growth in space. But since Pool 1 has occupied toomuch space, when reaching the max physical capacity, Pool 0 would failto do further write if the garbage collection is not quick enough, whilePool 1 still has plenty of space not utilized. This cannot be resolvedby traditional pool-based technology since it needs an overall pictureof the controller status and different workloads of all the pools.

To solve the issues of out-of-space situation and unbalanced space usageas described above for a storage system of a plurality of LSAs with ashared controller, it is necessary to predict the capacity usage for theLSAs and for the controller. Described below with reference to FIG. 4,embodiments of the present disclosure introduce a measure, the remainingtime buffer (RTB), to describe the estimated time that each LSA and thecontroller will use up their respective free space currently available.With such a measure, mechanisms to balance the free space of the LSAsand to detect out-of-space emergencies are possible.

FIG. 4 is a schematic diagram illustrating the space usage versus spaceconsuming speed for each entity (i.e. the LSA or the controller) in thestorage system as shown in FIG. 2. W_(i) (i=1˜4) represents spaceconsuming speed for each LSA (i.e. LSA 1 to 4) and W_(j) (j=a or b) foreach pool (i.e. Pool 0 to 1). Space consuming speed for an entityindicates how much free space the entity consumes or needs per unittime. Space consuming speed may be collected as a statistical averageover a relatively long time period or may be acquired instantaneously asserver applications perform I/O operations with the storage system. ForLSAs arranged in DR pools which adopt log-structured file system, writeoperations dominate the I/O workloads of the pools (and thus of theLSAs) and are always directed to locations in the physical free spacesequentially. The space consuming speed for an entity is a consequenceof both the I/O workload and garbage collection for that entity.Accordingly, the space consuming speeds for DR pools may be collected byobserving the workloads and garbage collection speeds of the pools,which may be quite easy to carry out. For pools other than datareduction pools, since write operations mostly occur in-place, the spaceconsumption speeds for such pools can be more difficult to be collectedas compared to DR pools, but are still possible to be collected usingvarious methods already known to those skilled in the art. Spaceconsuming speeds for Pool 0 and Pool 1 are divided onto space consumingspeeds of the LSAs in respective pools. In the example as shown in FIG.4, it is satisfied that W_(a)=W₁+W₂ and W_(b)=W₃+W₄. Besides, W_(c)which represents space consuming speed for the controller shared by LSA2 and LAS 3 is a sum of the space consuming speeds of LSA 2 and LSA 3,i.e. W_(c)=W₂+W₃.

As shown in FIG. 4, let m₁ and m₄ represent the total storage capacitiesrespectively for internal LSA 1 and LSA 4, m_(2-claimed) andm_(3-claimed) represent the storage capacities claimed respectively byTP LSA 2 and LSA 3 from the shared controller, and m₂ and m₃ representphysical storage capacity actually reserved by the controller for TP LSA2 and LSA 3. Since m_(2-claimed) and m_(3-claimed) are the claimedcapacities, they would not be changed unless the server applicationsexpand or shrink explicitly and they are the maximum that m₂ and m₃ canreach respectively. On the other hand, m₂ and m₃ are the underlyingphysical capacities, which get increased upon reaching each proportionpoint of the claimed capacities. By unmapping the extents (e.g. bygarbage-collecting those recently over-written extents) in the backendof the controller, m₂ and m₃ can be decreased too. It can be understoodthat m_(2-claimed)≥m₂ and m_(3-claimed)≥m₃. Normally, a sum of theclaimed capacities from a shared controller should be greater than thephysical capacity of the controller; otherwise, it is not a practicaland reasonable scenario using a shared controller for TP LSAs. Thusm_(2-claimed)+m_(3-claimed)≥m_(3-claimed), where m_(c) representsphysical storage capacity of the shared controller. Furthermore, as thephysical storage capacity provided by a controller is limited, a sum ofthe physical storage capacities actually reserved for TP LSAs associatedwith the controller should be no greater than the physical storagecapacity of the controller, i.e., m₂+m₃≥m_(c).

As write operations to DR Pool 0 and Pool 1 would be sequentiallystriped between their LSAs in proportion to the storage capacities ofthe LSAs, the following condition is satisfied.

W ₁ /W ₂ =m ₁ /m _(2-claimed) and W ₃ /W ₄ =m _(3-claimed) /m ₄.

Let R_(i) (i=1 or 2 or c) represents the relative rate of spaceconsumption for Pool 0 or Pool 1 or the controller. R_(i) may bedetermined as follows,

R₀ = W₁/m₁ = W₂/m_(2-claimed) = W_(a)/(m₁ + m_(2-claimed))  andR₁ = W₃/m_(3-claimed) = W₄/m₄ = W_(b)/(m_(3-claimed) + m₄)  and$R_{c} = {{\left( {W_{2} + W_{3}} \right)/m_{c}} = \frac{\begin{pmatrix}{{\left( {W_{a}*m_{2\text{-}{claimed}}} \right)/\left( {m_{1} + m_{2\text{-}{claimed}}} \right)} +} \\{\left( {W_{b}*m_{3\text{-}{claimed}}} \right)/\left( {m_{3\text{-}{claimed}} + m_{4}} \right)}\end{pmatrix}}{m_{c}}}$

For example, R_(i) may be in the unit of x %/hour. For short term andlong term concerns, raw value and statistical average value may berespectively used to describe each of them. Raw value of R_(i) may becollected on a cycle basis, where the cycle may be a fixed time intervalfor I/O operations directed to the storage system; while statisticalaverage value of R_(i) may be determined by observing the raw values fora predetermined time period and calculating a moving average value (e.g.Exponential Moving Average) based on the raw values.

To compare the space consuming status among the controller and the LSAs,a measure referred to as “Remaining Time Buffer (RTB)” is introduced toindicate time to use up free space currently available to the controlleror to each LSA. For each involved entity, either the controller or theLSA, the RTB measure may be determined as a ratio of the respective freespace currently available to the entity and the respective spaceconsuming speed of the entity. For a TP LSA, the free space currentlyavailable includes space from the total capacity claimed from acontroller that has not been used yet. For an internal LSA, the freespace currently available includes space from the total physicalcapacity that is not actually used yet. For a controller, the free spacecurrently available includes space from the total physical capacityprovided by the backend storage that has not been allocated to anyassociated LSAs yet. Depending on the way in which the space consumingspeed of the entity is collected, the RTB measure may be determined as amoving average in a time period (e.g. a relatively long time period) forlong term concern or on a cycle basis for a short term concern. The RTBmeasure may also be determined as a ratio of a percentage of respectivefree space over the overall capacity and the respective relative rate ofspace consumption. In the example as shown in FIG. 4, let RTB_(i) (i=1-4or c) represents the RTB measure for LSA 1-4 or for the controller.

For internal LSA 1 and 4,

${RTB}_{1} = {\frac{m_{1\text{-}{free}}}{W_{1}} = \frac{m_{1\text{-}{free}}/m_{1}}{R_{0}}}$${RTB}_{4} = {\frac{m_{4\text{-}{free}}}{W_{4}} = \frac{m_{4\text{-}{free}}/m_{4}}{R_{1}}}$

For TP LSA 2 and 3,

${RTB}_{2} = {\frac{m_{2\text{-}{free}}}{W_{2\;}} = \frac{m_{2\text{-}{free}}/m_{2\text{-}{claimed}}}{R_{0}}}$${RTB}_{3} = {\frac{m_{3\text{-}{free}}}{W_{3}} = \frac{m_{3\text{-}{free}}/m_{3\text{-}{claimed}}}{R_{1}}}$

For the controller,

${RTB}_{c} = {\frac{m_{c\text{-}{free}}}{W_{c}} = \frac{m_{c\text{-}{free}}/m_{c}}{R_{c}}}$

where m_(i-free) (i=1˜4 or c) represents the free space of LSA 1-4 orthe controller. In the example as shown in FIG. 4, LSA 2 has a claimedcapacity of 6 extents (m_(2-claimed)=6) and has used 3 extents (m₂=3),leaving m_(2-free) equal to 3 extents (m_(2-free)=m_(2-claimed)−m₂); LSA3 has a claimed capacity of 9 extents (m_(3-claimed)=9) and has used 6extents (m₃=6), leaving m_(3-free) equal to 3 extents(m_(3-free)=m_(3-claimed)−m₃); the controller has a total physicalcapacity of 12 extents (m_(c)=12) and has allocated 9 extents to LSA 2and LSA 3 (m₂+m₃=9), leaving m_(c-free) equal to 3 extents(m_(c-free)=m_(c)−(m₂+m₃)).

Based on the RTB measures, methods for managing storage capacity usage,in particular for addressing the issues of unbalanced space usage andout-of-space emergency, in a storage system with a plurality of LSAs anda shared controller can be implemented. FIG. 5 illustrates a flow chartof a method for managing storage capacity usage in a storage systemaccording to an embodiment of the disclosure.

At step 502, a Remaining Time Buffer (RTB) measure indicating time touse up respective free space currently available to each LSA in astorage system is calculated. The storage system may comprise aplurality of LSAs. In some embodiments, at least two of the LSAs mayshare the same controller. As described above, the shared controller isresponsible for providing and managing shared physical storage capacityfrom its backend storage devices to the at least two LSAs. A RTB measureindicating time to use up respective free space currently available tothe controller may be calculated for the controller. For the wholestorage system, there may be more than one shared controllers. In thatcase, a RTB measure may be calculated for each of the controllers. Theat least two LSAs that share the controller(s) may be thin provisioningLSAs. Furthermore, the at least two LSAs that share the controller(s)may be distributed in the same storage pool, or across different storagepools. In some examples, the storage pools may be data reduction poolsadopting log-structured file systems.

The RTB measure for each entity (i.e. the LSA or the controller) may bedetermined in a way as described above with a reference to FIG. 4. Insome embodiments, for balancing the space usage among the LSAs for along term concern, the RTB measure for each LSA is may be average ratioof the respective free space currently available and a respective spaceconsuming speed in a time period. Similarly, the RTB measure for ashared controller may be an average ratio of the respective free spacecurrently available to the controller and the respective space consumingspeed for the controller in the time period. The time period may berelatively long as compared to each I/O operation cycle. For example,the I/O operation cycle may be one to five minutes, while the timeperiod for calculating the RTB measure may be several hours. In otherwords, the system may monitor the instantaneous RTB measures forhundreds of cycles and then calculate a moving average based on theinstantaneous RTB measures. In other embodiments, for detection ofout-of-space emergency in a short term concern, the RTB measure for eachLSA may be an instantaneous ratio of the respective free space currentlyavailable and a respective space consuming speed on a cycle basis.Similarly, the RTB measure for a shared controller may be an averageratio of the respective free space currently available to the controllerand the respective space consuming speed for the controller on the cyclebasis. The cycle may refer to each I/O operation cycle as describedabove.

At step 504, respective free space currently available to each of one ormore of the LSAs are adjusted so that the RTB measures of the one ormore LSAs satisfy a threshold. In some embodiments, for balancing thespace usage among the LSAs for a long term concern, the threshold is aweighted RTB measure average based on the RTB measures and the spaceconsuming speeds of the controller and of the plurality of LSAs. Theweighted RTB measure average reflects a desired balanced time to use upfree space currently available to each entity involved in the storagesystem. If the RTB measures for all relating entities (including eachLSA and the controller(s)) are made approximate to the weighted RTBmeasure average, it can be ensured that no LSA is using up its currentlyavailable free space too fast or too slowly. Thus, all the LSAs can runout of their respective free space currently available at asubstantially aligned time, thereby improving the space efficiency ofthe whole storage system. Specifically, the weighted RTB measure averageRTB_(avg) may be calculated as,

${RTB}_{avg} = \frac{\sum{{RTB}_{i}*W_{i}}}{\sum W_{i}}$

where i indicates each LSA if all of the LSAs sharing the samecontroller have their RTB measures less than the RTB measure of theshared controller, or i indicates the shared controller(s) and each ofthe non-controller-sharing LSAs if any of the LSAs sharing the samecontroller has its RTB measure greater than or equal to the RTB measureof the shared controller.

For example, for the storage system as shown in FIG. 4, if it isdetermined that both RTB₂ and RTB₃ are less than RTB_(c), which meansthat the shared controller will not use up its physical free spacecurrently available before any of LSA 2 and LSA 3, then the weighted RTBmeasure average is calculated based on the RTB measures and spaceconsuming speeds of LSA 1-4 as follows.

${RTB}_{avg} = \frac{\sum\limits_{i = 1}^{4}{{RTB}_{i}*W_{i}}}{\sum\limits_{i = 1}^{4}W_{i}}$

If it is determined that any of RTB₂ and RTB₃ is greater than or equalto RTB_(c), it means that the shared controller will use up its physicalfree space currently available before LSA 2 or LSA 3. In other words,there is definitely an overlapped or competitive field of free space forLSA 2 and LSA 3. In such a case, the weighted RTB measure average iscalculated based on the RTB measures and space consuming speeds of LSA 1and 4 which are non-controller-sharing and of the controller as follows.

${RTB}_{avg} = \frac{{{RTB}_{1}*W_{1}} + {{RTB}_{c}*W_{c}} + {{RTB}_{4}*W_{4}}}{W_{1} + W_{c} + W_{4}}$

In other embodiments, for detection of out-of-space emergency in a shortterm concern, the threshold is a predetermined value. The predeterminedvalue may be a value uniform to all the LSAs. In a tiered storage systemwhere different types of data are stored on storage devices ofappropriate levels of performance and cost, for LSAs provided by storagedevices in the same tier, the predetermined values may be the same. Inother cases, the predetermined value may be a plurality of individualvalues for different LSAs. For example, it may be known in advance thatsome LSAs may take longer time to be restored or expanded after afailure of out-of-space than other LSAs. Then these LSAs may correspondto thresholds smaller than those of the other LSAs so that there can beenough time for them to be fixed after failure. In some embodiments, thethreshold, either uniform or non-uniform to the LSAs may vary over time.

In some embodiment, for a storage system comprises internal LSAs (e.g.LSA 1 and 4 as shown in FIG. 4) that do not share any common controller,before adjustment of any free space, the storage system may firstcompare the RTB measure of the shared controller with the RTB measuresof the internal LSAs. If the RTB measure of the shared controller isgreater than or equal to all the RTB measures of the internal LSAs, thenthere would be a time that one of the internal LSA uses up its physicalfree space and leads to the attached storage pool going down, while therest of the storage pools (including the LSAs) and the shared controllerstill have free space and go on working. In such a case, it is notnecessary to adjust the free spaces currently available to any LSA sincethe failure of one pool would not lead to other pools (and theassociated LSAs) and the shared controller in unavailable. Otherwise, ifthe RTB measure of the shared controller is less than the RTB measure ofany internal LSA, this can lead to a situation that when the competitivefree space is used up, all the pools (with the associated LSAs) will bedown due to no free physical space although there may still be much freespace in the internal LSAs. In such a case, adjustment of free spacescurrently available to one or more LSAs can be more advantageous.

In some embodiments, the one or more LSAs to each of which therespective free space currently available is adjusted may be the LSAssharing the same controller(s) whose RTB measure(s) does not satisfy thethreshold. Accordingly, making the RTB measures of the one or more LSAssatisfy a threshold further comprises making both the RTB measures ofthe LSAs sharing the same controller(s) and the RTB measure of thecontroller(s) satisfy the threshold. For example, in the examples asshown in FIG. 4, it is possible that one or both of RTB₂ and RTB₃satisfy the threshold, while RTB_(c) does not satisfy the threshold.This happens when LSA 2 or LSA 3 claims large capacity from thecontroller, while the actual free physical extents currently availablein the backend of the controller will soon be used up under the spaceconsuming speeds of LSA 2 and LSA 3. In such a case, although RTBmeasures for LSA 2 and LSA 3 might already satisfy the threshold, thefree spaces currently available to LSA 2 and LSA 3 are still adjusted tomake sure that RTB measures for LSA 2, LSA 3 and controller will allsatisfy the threshold eventually.

In some embodiments, to make the RTB measures of one or more LSAssatisfy a threshold comprises making the RTB measures of the one or moreLSAs greater than or equal to the threshold. In some embodiments, theone or more LSAs to each of which the respective free space currentlyavailable is adjusted may be the LSAs that have RTB measures less thanthe threshold. In other embodiments, the one or more LSAs to each ofwhich the respective free space is adjusted may be the LSAs each havingits free space currently available less than a respective free spaceboundary. The free space boundary for a LSA can be determined by amultiplication of the threshold with the respective space consumingspeed of the LSA.

The adjustment of the respective free space currently available to eachof the one or more LSAs may be performed automatically or manually. Theadjustment may comprise scaling up the backend storage devices for someLSAs so that larger physical capacities can be provided. In addition oralternatively, the adjustment may comprise migrating data from some LSAsto other LSAs. For data migration, a destination LSA will not use upfree space currently available to the destination LSA before a sourceLSA will do, even if at least part of the free space is reserved for thedata migration. In some embodiments, a destination LSA has a RTB measuresatisfies the threshold after reserving at least part of free spacecurrently available to the destination LSA for the data migration.Preferably, the RTB measure of the destination LSA is greater than orequal to the threshold after reserving at least part of the free space.

Similar to the mechanism of tiered storage system, a tiered datamigration can be provided. Various types of extent to be migrated fromthe source LSA are differentiated. The types of extent may include butnot limited to persistent extent (such as read-only or recentlyover-written extent), dynamic extent (such as write-intensive extent)and cold extent (such as extent that is not accessed for a long term).Next, the different types of extent are to be migrated onto destinationLSAs in appropriate tiers. Generally, LSAs provided in upper tiers havefaster access speed, lower capacity and higher cost. For example, Tier 0(the uppermost tier) may consist of SSD (Solid State Drive) RAID(Redundant Array of Independent Disks) arrays, consist of 3D-Xpoint RAIDarrays, consist of phase-change memory (PCM) RAID arrays, or consist ofother flash drive RAID arrays, Tier 1 (the intermediate tier) mayconsist of Enterprise DDM (Disk Drive Module) RAID arrays, and Tier 2(the lowermost tier) may consist of Nearline DDM RAID arrays. In someembodiments, persistent extent is migrated onto a destination LSA in thesame tier with the source LSA. In some embodiments, dynamic extent orcold extent is migrated onto a destination LSA in a different tier fromthe source LSA. For example, dynamic extent may be migrated onto uppertier LSA and cold extent may be migrated onto lower tier LSA. As such, ahigher efficiency in both the space utilization and the cost will beachieved.

With reference to FIG. 6, an exemplary process is illustrated that maymanage storage capacity usage for a storage system to achieve balancedfree space among all the entities involved in accordance with anembodiment of the present disclosure. The process may be executed on thecomputer system as shown in FIG. 1 as a background process. In one ormore embodiments, the process is initiated periodically in block 601where a RTB EMA is calculated for each entity. The entities may comprisea plurality of LSAs and one or more controllers each shared by at leasttwo of the LSAs. As described above with reference to FIG. 4, the RTBEMA may be calculated by observing the RTB measures in a plurality ofI/O operation cycles and calculating an exponential moving average ofthe RTB measures. Next, in block 602, the system determines whether thecurrent cycle is a partition cycle. The partition cycle refers to a timeperiod when appropriate data migration plans are made and executed. Theprocess will loop until the current cycle is the partition cycle totransfer to block 603. In block 603, the system determines if everyshared controller has been traversed. In response to a determinationthat all the shared controllers have been traversed, the processtransfer to block 613 where any existing migration plans will beexecuted. Otherwise, the process will transfer to blocks 604-612.

In block 604, a weighted RTB is determined based on the RTB EMAs ofrelating entities (e.g. including any LSA in the storage system and theshared controller(s)) calculated in block 601. The process ofdetermining the weighted RTB has been described with reference to FIG.4. Then, in block 605, the system determines if any relating entity hasa RTB EMA less than the weighted RTB. A negative result in block 605will lead the process to loop back to block 603, while a positive resultin block 605 will lead the process to transfer to blocks 606-611 where adata migration plan may be generated. If the entity that has the RTB EMAless than weighted RTB is a LSA, source entity for the data migrationplan can be that LSA. Otherwise, if the entity that has the RTB EMA lessthan weighted RTB is a controller, the source entity for the datamigration plan can be each of the LSAs that share the controller.

As described above, in blocks 606-611 the data migration plan may begenerated as a tiered data migration in which the destination entity forthe data migration is determined based on the type of data extentsexisting on the source entity. The destination entity may be another LSAin the storage system. First, the system attempts to find if there isany persistent extent on the source entity. If the persistent extent isfound, then the system attempts to determine an appropriate destinationentity in the same tier with the source entity. The destination entityis referred to as being appropriate if it will have a RTB EMA greaterthan or equal to the weighted RTB even after accepting the persistentextent. If no persistent extent can be found on the source entity, thenthe system continues to find if there is any dynamic extent or coldextent on the source entity after accepting the persistent extent. Ifthe dynamic extent or cold extent is found, then the system attempts todetermine an appropriate destination entity in a different tier from thesource entity. The destination entity is referred to as beingappropriate if it will have a RTB EMA greater than or equal to theweighted RTB even after accepting the dynamic extent or cold extent. Inany case, as long as both the extent on the source entity and thecorresponding destination entity are found, the data migration plan canbe generated successfully, as shown in block 611. Otherwise, the processtransfers to block 610 where the current source entity is removed frombeing chosen and another source entity will be considered.

Subsequent to block 611, in block 612, the system determines if thesource entity has a RTB EMA greater than or equal to the weighted RTBafter migrating some of its extents to the destination entity. Anegative result means that the source entity is still in the risk ofrunning out of its free space soon and data migration to moredestination entities is still desired. Thus, the process may loop backto block 604. A positive result means that the source entity is now in abalanced status in term of remaining time to use up its free space withother entities, and thus the process may then loop back to block 610.

With reference to FIG. 7, an exemplary process is illustrated that maymanage storage capacity usage for a storage system to detect and avoidout-of-space emergency in accordance with an embodiment of the presentdisclosure. The exemplary process is generally similar to the processillustrated in FIG. 6 with the differences lie in that (1) in block 701,a RTB value other than RTB EMA is calculated for each entity on a cyclebasis; (2) since the RTB value is calculated on each cycle, there is noneed to wait for the partition cycle as shown in block 602 of FIG. 6;(3) instead of determining a weighted RTB as shown in block 604 of FIG.6, the process of FIG. 7 directly compares the RTB of each entity with aRTB threshold and in subsequent blocks 706-712 the RTB threshold is usedin place of the weighted RTB as used in blocks 606-612 of FIG. 6.Various embodiments of the RTB threshold have been described withreference to FIG. 5.

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer readable storagemedium (or media) having computer readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

According to an embodiment of the present disclosure, there is provideda computing system. The computing system comprises a processor and acomputer-readable memory unit coupled to the processor, the memory unitcomprising instructions, when executed by the processor, for managingstorage capacity usage in a storage system. The instructions formanaging storage capacity usage in the storage system compriseinstructions for calculating, for each of a plurality of logical storagearrays in the storage system, a Remaining Time Buffer (RTB) measureindicating time to use up respective free space currently available tothe logical storage array. The instructions for managing storagecapacity usage in the storage system further comprise instructions foradjusting respective free space currently available to each of one ormore of the plurality of logical storage arrays so that the RTB measuresof the one or more logical storage arrays satisfy a threshold.

According to an embodiment of the computing system, for each of theplurality of logical storage arrays, the RTB measure is calculated as anaverage ratio of the respective free space currently available and arespective space consuming speed in a time period.

According to an embodiment of the computing system, the instructions formanaging storage capacity usage in the storage system further compriseinstructions for calculating, for a controller shared by at least two ofthe plurality of logical storage arrays, a RTB measure indicating timeto use up respective free space currently available to the controller.The threshold is a weighted RTB measure average based on the RTBmeasures and the space consuming speeds of the controller and of theplurality of logical storage arrays.

According to an embodiment of the computing system, for each of theplurality of logical storage arrays, the RTB measure is calculated as aninstantaneous ratio of the respective free space currently available anda respective space consuming speed on a cycle basis.

According to an embodiment of the computing system, the threshold is apredetermined value.

According to an embodiment of the computing system, the instructions foradjusting the respective free space currently available to each of theone or more logical storage arrays further comprise instructions for:determining a destination logical storage array for receiving datamigration from the one or more logical storage arrays, wherein thedestination logical storage array has a RTB measure satisfies thethreshold after reserving at least part of free space currentlyavailable to the destination logical storage array for the datamigration.

According to an embodiment of the computing system, the destinationlogical storage array is from the same tier with the one or more logicalstorage arrays if persistent extent is to be migrated from the one ormore logical storage arrays.

According to an embodiment of the computing system, the destinationlogical storage array is from a different tier from the one or morelogical storage arrays if dynamic extent or cold extent is to bemigrated from the one or more logical storage arrays.

According to an embodiment of the present disclosure, there is provideda computer program product. The computer program product comprises acomputer readable storage medium having program instructions embodiedtherewith, the program instructions executable by a processor to causethe processor to manage storage capacity usage in a storage system. Theprogram instructions to cause the processor to manage storage capacityusage in the storage system further comprise program instructions tocause the processor to perform actions of: calculating, for each of aplurality of logical storage arrays in the storage system, a RemainingTime Buffer (RTB) measure indicating time to use up respective freespace currently available to the logical storage array. The programinstructions to cause the processor to manage storage capacity usage inthe storage system further comprise program instructions to cause theprocessor to perform actions of: adjusting respective free spacecurrently available to each of one or more of the plurality of logicalstorage arrays so that the RTB measures of the one or more logicalstorage arrays satisfy a threshold.

According to an embodiment of the computer program product, for each ofthe plurality of logical storage arrays, the RTB measure is calculatedas an average ratio of the respective free space currently available anda respective space consuming speed in a time period.

According to an embodiment of the computer program product, the programinstructions to cause the processor to manage storage capacity usage inthe storage system further comprise program instructions to cause theprocessor to perform actions of: calculating, for a controller shared byat least two of the plurality of logical storage arrays, a RTB measureindicating time to use up respective free space currently available tothe controller. The threshold is a weighted RTB measure average based onthe RTB measures and the space consuming speeds of the controller and ofthe plurality of logical storage arrays.

According to an embodiment of the computer program product, for each ofthe plurality of logical storage arrays, the RTB measure is calculatedas an instantaneous ratio of the respective free space currentlyavailable and a respective space consuming speed on a cycle basis.

According to an embodiment of the computer program product, thethreshold is a predetermined value.

According to an embodiment of the computer program product, the programinstructions to cause the processor to perform the action of adjustingthe respective free space currently available to each of the one or morelogical storage arrays further comprise program instructions to causethe processor to perform an action of: determining a destination logicalstorage array for receiving data migration from the one or more logicalstorage arrays, wherein the destination logical storage array has a RTBmeasure satisfies the threshold after reserving at least part of freespace currently available to the destination logical storage array forthe data migration.

According to an embodiment of the computer program product, thedestination logical storage array is from the same tier with the one ormore logical storage arrays if persistent extent is to be migrated fromthe one or more logical storage arrays.

According to an embodiment of the computer program product, thedestination logical storage array is from a different tier from the oneor more logical storage arrays if dynamic extent or cold extent is to bemigrated from the one or more logical storage arrays.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general-purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

1. A method for managing storage capacity usage in a storage system, themethod comprising: calculating, for each of a plurality of logicalstorage arrays in the storage system, a Remaining Time Buffer (RTB)measure indicating time to use up respective free space currentlyavailable to the logical storage array, wherein for each of theplurality of logical storage arrays, the RTB measure is calculated as anaverage ratio of the respective free space currently available and arespective space consuming speed in a time period; adjusting respectivefree space currently available to each of one or more of the pluralityof logical storage arrays so that RTB measures of the one or morelogical storage arrays satisfy a threshold; and calculating, for acontroller shared by at least two of the plurality of logical storagearrays, a RTB measure indicating time to use up respective free spacecurrently available to the controller, wherein the threshold is aweighted RTB measure average based on the RTB measures of both of thecontroller and the plurality of logical storage arrays and the spaceconsuming speeds of both of the controller and the plurality of logicalstorage arrays. 2.-3. (canceled)
 4. The method of claim 1, wherein foreach of the plurality of logical storage arrays, the RTB measure iscalculated as an instantaneous ratio of the respective free spacecurrently available and a respective space consuming speed on a cyclebasis.
 5. The method of claim 4, wherein the threshold is apredetermined value uniform to all logic storage arrays.
 6. The methodof claim 1, wherein adjusting the respective free space currentlyavailable to each of the one or more logical storage arrays comprises:determining a destination logical storage array for receiving datamigration from the one or more logical storage arrays, wherein thedestination logical storage array has a RTB measure satisfies thethreshold after reserving at least part of free space currentlyavailable to the destination logical storage array for the datamigration.
 7. The method of claim 6, wherein the destination logicalstorage array is from the same tier with the one or more logical storagearrays if persistent extent is to be migrated from the one or morelogical storage arrays.
 8. The method of claim 6, wherein thedestination logical storage array is from a different tier from the oneor more logical storage arrays if dynamic extent or cold extent is to bemigrated from the one or more logical storage arrays.
 9. A computingsystem, comprising: a processor; and a computer-readable memory unitcoupled to the processor, the memory unit comprising instructions, whenexecuted by the processor, for managing storage capacity usage in astorage system, wherein the instructions for managing storage capacityusage in the storage system comprise instructions for: calculating, foreach of a plurality of logical storage arrays in the storage system, aRemaining Time Buffer (RTB) measure indicating time to use up respectivefree space currently available to the logical storage array, wherein foreach of the plurality of logical storage arrays, the RTB measure iscalculated as an average ratio of the respective free space currentlyavailable and a respective space consuming speed in a time period;adjusting respective free space currently available to each of one ormore of the plurality of logical storage arrays so that RTB measures ofthe one or more logical storage arrays satisfy a threshold; andcalculating, for a controller shared by at least two of the plurality oflogical storage arrays, a RTB measure indicating time to use uprespective free space currently available to the controller, wherein thethreshold is a weighted RTB measure average based on the RTB measures ofboth of the controller and the plurality of logical storage arrays andthe space consuming speeds of both of the controller and the pluralityof logical storage arrays. 10.-11. (canceled)
 12. The computing systemof claim 9, wherein for each of the plurality of logical storage arrays,the RTB measure is calculated as an instantaneous ratio of therespective free space currently available and a respective spaceconsuming speed on a cycle basis.
 13. The computing system of claim 12,wherein the threshold is a predetermined value uniform to all logicstorage arrays.
 14. The computing system of claim 9, wherein theinstructions for adjusting the respective free space currently availableto each of the one or more logical storage arrays further compriseinstructions for: determining a destination logical storage array forreceiving data migration from the one or more logical storage arrays,wherein the destination logical storage array has a RTB measuresatisfies the threshold after reserving at least part of free spacecurrently available to the destination logical storage array for thedata migration.
 15. A computer program product, comprising a computerreadable storage medium having program instructions embodied therewith,the program instructions executable by a processor to cause theprocessor to manage storage capacity usage in a storage system, whereinthe program instructions to cause the processor to manage storagecapacity usage in the storage system further comprise programinstructions to cause the processor to perform actions of: calculating,for each of a plurality of logical storage arrays in the storage system,a Remaining Time Buffer (RTB) measure indicating time to use uprespective free space currently available to the logical storage array,wherein for each of the plurality of logical storage arrays, the RTBmeasure is calculated as an average ratio of the respective free spacecurrently available and a respective space consuming speed in a timeperiod; adjusting respective free space currently available to each ofone or more of the plurality of logical storage arrays so that RTBmeasures of the one or more logical storage arrays satisfy a threshold;and calculating, for a controller shared by at least two of theplurality of logical storage arrays, a RTB measure indicating time touse up respective free space currently available to the controller,wherein the threshold is a weighted RTB measure average based on the RTBmeasures of both of the controller and the plurality of logical storagearrays and the space consuming speeds of both of the controller and theplurality of logical storage arrays. 16.-17. (canceled)
 18. The computerprogram product of claim 15, wherein for each of the plurality oflogical storage arrays, the RTB measure is calculated as aninstantaneous ratio of the respective free space currently available anda respective space consuming speed on a cycle basis.
 19. The computerprogram product of claim 18, wherein the threshold is a predeterminedvalue uniform to all logic storage arrays.
 20. The computer programproduct of claim 15, wherein the program instructions to cause theprocessor to perform the action of adjusting the respective free spacecurrently available to each of the one or more logical storage arraysfurther comprise program instructions to cause the processor to performan action of: determining a destination logical storage array forreceiving data migration from the one or more logical storage arrays,wherein the destination logical storage array has a RTB measuresatisfies the threshold after reserving at least part of free spacecurrently available to the destination logical storage array for thedata migration.